Performance analysis of CAR: Centralized adaptive reservation

A centralized adaptive reservation (CAR) protocol has been proposed in [1] for supporting constant bit rate (CBR), variable bit rate (VBR) and unspecified bit rate (UBR) services in a starconfigured network. This protocol has two main features. First, both the access probability and the bandwidth for reservation requests are varied dynamically to enhance efficiency. Second, by using a request-mini-slot method, UBR traffic can only utilize the residual bandwidth of the other traffic. In this paper, we derive a Markov chain model for analyzing the performance of the CAR protocol by means of a bi-state traffic source. The focus is to analyze the performance of the VBR stations when both the access probability and the bandwidth for reservation requests are changed dynamically.published_or_final_versio

ISDN3: The next generation networks

Two generations of Integrated Services Digital Network (ISDN), namely ISDN1 and ISDN2, have been developed in the last century. In our view, the convergence of ATM, Internet and active networks will form the basis for the next generation networks called ISDN3. In this paper, we first review ISDN1 and ISDN2 as well as the Internet and active networks. We then discuss some fundamental questions related to the design of ISDN3. Finally, we compare ISDN3 with ISDN1 and ISDN2, and outline what ISDN3 might look like.published_or_final_versio

Active routing service for the next-generation network/ISDN3

In recent years, a new routing method, known as active routing, has been emerging. This involves using active packets to configure customized network paths. Based on a Markov decision model, this paper presents an active routing service for active networks in general and the next generation network, called ISDN3, in particular. Our aim is to determine the active routing policy so as to minimize the network cost. Theoretical analysis is presented to show the advantages of our proposal as compared with three other approaches.published_or_final_versio

CARES Model for Computing Education

202210 bcchAuthor’s OriginalSelf-fundedPublishe

Teaching entrepreneurship using C3 Model-Map

202210 bcchAuthor’s OriginalSelf-fundedPublishe

LeG for enhancing student communication and learning experience

2022 IEEE 46th Annual Computers, Software, and Applications Conference (COMPSAC), 27 June 2022 - 01 July 2022, Los Alamitos, CA, USA202307 bcwwAccepted ManuscriptOthersPolyU (49KT)Publishe

A special virtual keyboard for disabled computer users

International MultiConference of Engineers and Computer Scientists 2017, IMECS 2017, Hong Kong, March 15-17, 20172016-2017 > Academic research: refereed > Refereed conference paper201807 bcrcVersion of RecordPublishe

A survey on indoor positioning security and privacy

202307 bcwwNot applicableOthersHK PhD FellowshipPublished24 month

Agency costs and management contracting: Granting executive stock options as a strategic compensation practice?

10.1109/MWC.2006.1593521International Journal of Human Resources Development and Management1122-4

Cross-Layer Enhanced Real-Time Packet Scheduling over CDMA Networks

Most existing scheduling algorithms for real-time traffic in code division multiple access (CDMA) networks bound the bit error rate (BER) in order to guarantee the packet error rate (PER) of each packet However, there is a tradeoff between PER and the packet drop rate (PDR) caused by delay violations, i.e., by slightly degrading the PER, more packets can be sent thus lowering PDIR. This paper defines a new problem for scheduling real-time traffic in time division multicode CDMA networks, which optimizes the PER and PDR jointly across the physical and link layers. These two metrics make up the total packet loss ratio (PLR). A novel cross-layer enhanced real-time packet scheduling algorithm is proposed to optimize the PLR experienced by each user in each frame, and distribute it fairly between users over the long term. Simulation results show that the proposed algorithm provides fairness in packet losses among users of different traffic classes, and achieves superior performance over previous algorithms in reducing PLR and increasing system capacityDepartment of ComputingRefereed conference pape